全文获取类型
收费全文 | 380篇 |
免费 | 72篇 |
国内免费 | 13篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 4篇 |
2021年 | 7篇 |
2020年 | 10篇 |
2019年 | 7篇 |
2018年 | 6篇 |
2017年 | 13篇 |
2016年 | 13篇 |
2015年 | 24篇 |
2014年 | 17篇 |
2013年 | 70篇 |
2012年 | 19篇 |
2011年 | 24篇 |
2010年 | 21篇 |
2009年 | 27篇 |
2008年 | 27篇 |
2007年 | 27篇 |
2006年 | 17篇 |
2005年 | 20篇 |
2004年 | 16篇 |
2003年 | 12篇 |
2002年 | 11篇 |
2001年 | 13篇 |
2000年 | 10篇 |
1999年 | 11篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有465条查询结果,搜索用时 15 毫秒
91.
In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039 相似文献
92.
We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
93.
94.
Within a reasonable life‐testing time, how to improve the reliability of highly reliable products is one of the great challenges to today's manufacturers. By using a resolution III experiment together with degradation test, Tseng, Hamada, and Chiao (1995) presented an interesting case study of improving the reliability of fluorescent lamps. However, in conducting such an experiment, they did not address the problem of how to choose the optimal settings of variables, such as sample size, inspection frequency, and termination time for each run, which are influential to the correct identification of significant factors and the experimental cost. Assuming that the product's degradation paths satisfy Wiener processes, this paper proposes a systematic approach to the aforementioned problem. First, an intuitively appealing identification rule is proposed. Next, under the constraints of a minimum probability of correct decision and a maximum probability of incorrect decision of the proposed identification rule, the optimum test plan (including the determinations of inspection frequency, sample size, and termination time for each run) can be obtained by minimizing the total experimental cost. An example is provided to illustrate the proposed method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 514–526, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10024 相似文献
95.
We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016 相似文献
96.
效能准则及其选取原则探讨 总被引:3,自引:1,他引:2
对武器系统效能分析中一个十分重要的步骤──效能准则及其选取原则进行了探讨,分析了效能准则的多种具体形式,并提出了选取效能准则的几个原则,为效能分析的定性化阶段提供一些有益启示。 相似文献
97.
98.
本文对接地双层介质结构上的阿基米德平面螺旋天线进行了研究。以接地双层结构上水平赫芝偶极子Sommerfeld型积分的格林函数为基础,用矩量法求解积分方程,从而确定出螺旋天线臂上的电流分布。用渐近法估计Sommerfeld积分得到远区电场的解析表达式,由此计算出输入阻抗、方向图、功率增益和轴比。这些参数值对于双层结构上印刷线天线的优化设计具有重要指导意义。实验结果证明了数值方法的正确性 相似文献
99.
袁建民 《国防科技大学学报》1988,10(3):52-58 ,112
利用原子的Roothaan-Hartree-Fock波函数计算了低能e~--He和e~--Ar弹性散射截面。计算采用模型势方法,其中包括静电势、交换势和极化势。计算结果和实验吻合较好。通过把我们的计算结果和其他作者利用不同原子波函数的计算结果进行比较,讨论了不同原子波函数之间的差别对计算结果的影响。 相似文献
100.
袁建民 《国防科技大学学报》1988,10(1):87-92
本文提出一种对具有相同角量子数的壳层取平均的自相互作用修正势,保证了单电子波函数之间的正交性,计算结果好于x_a方法和作者本人及其他作者提出的单一平均自相互作用修正势的计算结果。 相似文献